An Algebraic Characterization of the Halting Probability
نویسنده
چکیده
Using 1947 work of Post showing that the word problem for semigroups is unsolvable, we explicitly exhibit an algebraic characterization of the bits of the halting probability Ω. Our proof closely follows a 1978 formulation of Post’s work by M. Davis. The proof is selfcontained and not very complicated.
منابع مشابه
The Halting Probability via Wang Tiles
Using work of Hao Wang, we exhibit a tiling characterization of the bits of the halting probability Ω. Algorithmic information theory [2] shows that pure mathematics is infinitely complex and contains irreducible complexity. The canonical example of such irreducible complexity is the infinite sequence of bits in the base-two expansion of the halting probability Ω. The halting probability is def...
متن کاملAn Algebraic Equation for the Halting Probability
We outline our construction of a single equation involving only addition, multiplication, and exponentiation of non-negative integer constants and variables with the following remarkable property. One of the variables is considered to be a parameter. Take the parameter to be 0, 1, 2, . . . obtaining an infinite series of equations from the original one. Consider the question of whether each of ...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملCharacterization and axiomatization of all semigroups whose square is group
In this paper we give a characterization for all semigroups whose square is a group. Moreover, we axiomatize such semigroups and study some relations between the class of these semigroups and Grouplikes,introduced by the author. Also, we observe that this paper characterizes and axiomatizes a class of Homogroups (semigroups containing an ideal subgroup). Finally, several equivalent conditions ...
متن کاملAn Algebraic Characterization of Equivalent Bayesian Networks
In this paper, we propose an algebraic characterization for equivalent classes of Bayesian networks. Unlike the other characterizations, which are based on the graphical structure of Bayesian networks, our algebraic characterization is derived from the intrinsic algebraic structure of Bayesian networks, i.e., joint probability distribution factorization. The new proposed algebraic characterizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 79 شماره
صفحات -
تاریخ انتشار 2007